Reducing Boolean Networks with Backward Boolean Equivalence

نویسندگان

چکیده

Boolean Networks (BNs) are established models to qualitatively describe biological systems. The analysis of BNs might be infeasible for medium large due the state-space explosion problem. We propose a novel reduction technique called Backward Equivalence (BBE), which preserves some properties interest BNs. In particular, reduced provide compact representation by grouping variables that, if initialized equally, always updated equally. resulting state space is subset original one, restricted identical initialization grouped variables. corresponding trajectories BN can exactly restored. show effectiveness BBE performing large-scale validation on whole GINsim repository. selected cases, we how our method enables analyses that would otherwise intractable. Our complements, and combined with, other methods found in literature.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-Boolean Equivalence

which ought to have the value true despite the fact that the second disjunct is undefined. Such expressions, sometimes called quasi-boolean [7], are traditionally handled by the conditional connectives cand and cor [6] [9]. However, these do not satisfy pleasant algebraic laws and their use tends to complicate calculations to an unacceptable degree. In the present paper, we show that the proble...

متن کامل

Omega-almost Boolean rings

In this paper the concept of an $Omega$- Almost Boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $Omega$- Almost Boolean ring over a locally Boolean space.

متن کامل

CCZ-equivalence and Boolean functions

We study further CCZ-equivalence of (n,m)-functions. We prove that for Boolean functions (that is, for m = 1), CCZ-equivalence coincides with EA-equivalence. On the contrary, we show that for (n,m)functions, CCZ-equivalence is strictly more general than EAequivalence when n ≥ 5 and m is greater or equal to the smallest positive divisor of n different from 1. Our result on Boolean functions allo...

متن کامل

Boolean networks with veto functions.

Boolean networks are discrete dynamical systems for modeling regulation and signaling in living cells. We investigate a particular class of Boolean functions with inhibiting inputs exerting a veto (forced zero) on the output. We give analytical expressions for the sensitivity of these functions and provide evidence for their role in natural systems. In an intracellular signal transduction netwo...

متن کامل

Identification problems for Boolean networks and Boolean control networks

In this paper we address various forms of identification problems for Boolean networks (BNs) and for Boolean control networks (BCNs). For the former, we assume to have a set of infinite or finite support output trajectories and we want to identify a BN compatible with those trajectories. Conditions for the identified BN to coincide (up to a relabeling) with the original BN are provided. For BCN...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-85633-5_1